Bounding completion times of jobs with arbitrary release times and variable execution times
نویسندگان
چکیده
In many real-time systems, the workload can be characterized as a set of jobs with linear precedence constraints among them. Jobs often have variable execution times and arbitrary release times. We describe here three algorithms that can be used to compute upper bounds on completion times of such jobs scheduled on a priority-driven basis. The algorithmshave different performance and complexity. Simulation was performed to compare their performance.
منابع مشابه
Bounding Completion Times of Jobs with Arbitrary Release Times, Variable Execution Times and Resource Sharing
| The workload of many real-time systems can be characterized as a set of preemptable jobs with linear precedence constraints. Typically their execution times are only known to lie within a range of values. In addition jobs share resources and access to the resources must be synchronized to ensure the integrity of the system. This paper is concerned with the schedulability of such jobs when sch...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملMeta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملSequencing to Minimize the Total Weighted Completion Times Subject to Resources and Arbitrary Precedence
We present an anlgorithm for minimizing the sum of the weighted completion times of n jobs that are subject to arbitrary precedence, when each job may require the simultaneous occupancy of a subset of m resources.
متن کاملEecient Methods of Validating Timing Constraints
Analytical and eecient validation methods to determine whether all jobs always complete by their deadlines are not yet available for systems using modern dynamic scheduling strategies. Exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. This chapter presents several worst-case bounds and eecient algorithms for determining how lat...
متن کامل